A Mixed Algorithm for Nonlinear Complementarity Problems
نویسندگان
چکیده
Combining nonmonotone trust region algorithms and PSO methods, we propose a mixed method for nonlinear complementarity problems. The iterative formula of k μ is very simple. When the determinant of k k B I λ + is very large or small, the PSO method will obtain a new point which gets us better astringency. Numerical test results show the effectiveness of this algorithm.
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملQPCOMP: A quadratic programming based solver for mixed complementarity problems
QPCOMP is an extremely robust algorithm for solving mixed nonlinear complementarity problems that has fast local convergence behavior. Based in part on the NE/SQP method of Pang and Gabriell14], this algorithm represents a signiicant advance in robustness at no cost in eeciency. In particular, the algorithm is shown to solve any solvable Lipschitz continuous, continuously diierentiable, pseudo-...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملA Penalty Technique for Nonlinear Complementarity Problems
In this paper, we first give a new equivalent optimization form to nonlinear complementarity problems and then establish a damped Newton method in which penalty technique is used. The subproblems of the method are lower-dimensional linear complementarity problems. We prove that the algorithm converges globally for strongly monotone complementarity problems. Under certain conditions, the method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 6 شماره
صفحات -
تاریخ انتشار 2011